An Axiomatic Theory of Fuzzy Quantifiers in Natural Languages
نویسندگان
چکیده
Many applications e.g. in approximate reasoning, data summarisation, information retrieval etc. can profit from the use of fuzzy quantifiers like “almost all” or “many”, which provide flexible means of information aggregation, and are capable of extracting meaningful linguistic summaries from large amounts of raw data. However, as will be shown by a number of counterexamples, existing approaches fail to provide a convincing interpretation of fuzzy quantifiers in the important case of two-place quantification (e.g. “about half of the blondes are tall”). The interpretation of fuzzy quantifiers should hence be based on a solid axiomatic foundation in order to guarantee predictable and linguistically wellmotivated results. In the report, an independent axiom system for “reasonable” approaches to fuzzy quantification is introduced, that are consistent with the use of quantifiers in NL. A number of linguistic adequacy criteria are formalized and it is shown that every model of the axiom system exhibits these essential properties. However, some principled adequacy bounds for approaches to fuzzy quantification are also established, which in most cases result from the known conflict between idempotence/distributivity and the law of contradiction in the presence of fuzziness. In addition, a broad class of models of the axiomatic framework is introduced. One of these models, which generalises the Sugeno integral (and hence the FG-count approach) can be shown to possess unique adequacy properties. Its analysis unveals the first definition of fuzzy cardinality which achieves adequate results with arbitrary quantitative one-place quantifiers. It is also shown how the Choquet integral (and hence the OWA approach) can be generalized to a model of the axiomatic framework. The resulting models not only represent a significant theoretical advance in fuzzy quantification; they are also practical. Efficient histogram-based algorithms for evaluating the resulting fuzzy quantifiers are described at the end of the report.
منابع مشابه
A Formal Theory of Fuzzy Natural Language Quantification and its Role in Granular Computing
Fuzzy quantification is a linguistic granulation technique capable of expressing the global characteristics of a collection of individuals, or a relation between individuals, through meaningful linguistic summaries. However, existing approaches to fuzzy quantification fail to provide convincing results in the important case of two-place quantification (e.g. “many blondes are tall”). We develop ...
متن کاملForschungsberichte der Technischen Fakultät Abteilung Informationstechnik Fuzzy Quantifiers for Processing Natural Language Queries in Content - Based Multimedia
The processing of natural language (NL) queries and the search for semantic matches between such queries and the contents of multimedia documents necessitate powerful quantifiers that adequately model quantifying expressions in NL. In this report, we develop an axiomatic theory of fuzzy NL quantifiers and present a model of this theory which makes its systematical interpretation possible. The n...
متن کاملData Fusion Based on Fuzzy Quantifiers
Fuzzy quantifiers (like many, few, ) are an important research topic not only due to their abundance in natural language (NL), but also because an adequate account of these quantifiers would provide a class of powerful yet human-understandable operators for information aggregation and data fusion. We introduce the DFS theory of fuzzy quantification, present a model of the theory, and describe a...
متن کاملFuzzy quantifiers: a linguistic technique for data fusion
Fuzzy quantifiers like “few”, “almost”, “about” and many others abound in natural language. They are used by humans for describing uncertain facts, quantitative relations and processes. An adequate contradiction-free computer-operational implementation of these quantifiers would provide a class of powerful yet human-understandable operators both for aggregation and fusion of data but also for s...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000